A note on the two-sided regulated random walk
نویسنده
چکیده
In this paper we address the two-sided regulated random walk defined by the relation XN(t + 1)= min(N,max(0,XN(t)+ A(t+1))) where (A(t); t 1) is a sequence of i.i.d r.v’s with integer values such that A(t) −1,E{A} = 0 and E{rA}<+∞ for an r > 1. Denoting by πN its stationary distribution, FN(x)= πN([0,Nx]) and G(x) the d.f of a uniform r.v on [0,1]. It is shown that 0 < limN‖FN −G‖p limN‖FN −G‖p <+∞ for 1 p +∞, that is: 1/N is the exact convergence rate of FN to G. This result improves (in the particular case considered) earlier results claiming that limN ‖FN −G‖∞ = 0. 2003 Elsevier SAS. All rights reserved. Résumé Cet article considère la marche aléatoire doublement régulée, définie par la relation de récurrence XN(t + 1) = min(N,max(0,XN(t) + A(t + 1))) où (A(t); t 1) est une suite de v.a entières i.i.d vérifiant A(t) −1,E{A} = 0 et E{rA}<+∞ pour un r > 1. Notant πN sa distribution stationnaire, FN(x) = πN([0,Nx]) et G(x) la f.r d’une v.a uniforme sur [0,1], nous montrons que 0 < limN‖FN −G‖p limN‖FN −G‖p <+∞ pour tout p tel que 1 p +∞. C’est à dire que 1/N est le taux exact de convergence de FN vers G. Ce résultat améliore (dans le cas particulier considéré) un résultat antérieur affirmant que limN ‖FN −G‖∞ = 0. 2003 Elsevier SAS. All rights reserved. MSC: primary 60J10, 60K25; secondary 60F25, 60F99
منابع مشابه
Two-sided loop-erased random walk in three dimensions
The loop-erased random walk (LERW) in three dimensions is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the “middle” of the path.
متن کاملThe infinite two-sided loop-erased random walk
The loop-erased random walk (LERW) in Zd, d ≥ 2, dimensions is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the “middle” of the path.
متن کاملLecture Space-Bounded Derandomization
We now prove Theorem 1. Let M be a probabilistic machine running in space S (and time 2S), using R random bits, and deciding a language L with two-sided error. (Note that S, R are functions of the input length n, and the theorem requires S = Ω(log n).) We will assume without loss of generality that M always uses exactly R random bits on all inputs. Fixing an input x and letting ` be some parame...
متن کاملNotes on Complexity Theory Last updated : December , 2011 Lecture 27
We now prove Theorem 1. Let M be a probabilistic machine running in space S (and time 2S), using R ≤ 2S random bits, and deciding a language L with two-sided error. (Note that S, R are functions of the input length n, and the theorem requires S = Ω(log n).) We will assume without loss of generality that M always uses exactly R random bits on all inputs; recall also that M has read-once access t...
متن کاملTwo-Sided Tolerance Interval for Exponential Distribution Based on Records
Tolerance interval is a random interval that contains a proportion of the population with a determined confidence level and is applied in many application fields such as reliability and quality control. In this paper, based on record data, we obtain a two-sided tolerance interval for the exponential population. An example of real record data is presented. Finally, we discuss the accuracy of ...
متن کامل